飞船再入舱三维化学非平衡流数值模拟

对飞船再入舱高超声速化学非平衡三维流场进行数值模拟。控制方程为含化学反应源项的全Ｎａｖｉｅｒ－ Ｓｔｏｋｅｓ 方程组, 化学模型为高温空气的七组元模型, 其组元成分为Ｎ２ 、Ｏ２、ＮＯ、Ｎ、Ｏ、ＮＯ＋ 、ｅ－ 。差分格式采用张涵信院士提出的ＮＮＤ激波捕捉格式并用全耦合方法处理流动方程及化学反应方程, 对化学反应源项采用全隐式处理, 运用时间预处理技术以加快收敛。同时, 也对完全气体模型进行计算, 以分析真实气体效应。与实验数据对比, 说明本文结果是可信的。     

Constrained minimax optimization of continuous search efforts for the detection of a stationary target

Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Production to order and off‐line inspection when the production process is partially observable

This study combines inspection and lot‐sizing decisions. The issue is whether to INSPECT another unit or PRODUCE a new lot. A unit produced is either conforming or defective. Demand need to be satisfied in full, by conforming units only. The production process may switch from a “good” state to a “bad” state, at constant rate. The proportion of conforming units in the good state is higher than in the bad state. The true state is unobservable and can only be inferred from the quality of units inspected. We thus update, after each inspection, the probability that the unit, next candidate for inspection, was produced while the production process was in the good state. That “good‐state‐probability” is the basis for our decision to INSPECT or PRODUCE. We prove that the optimal policy has a simple form: INSPECT only if the good‐state‐probability exceeds a control limit. We provide a methodology to calculate the optimal lot size and the expected costs associated with INSPECT and PRODUCE. Surprisingly, we find that the control limit, as a function of the demand (and other problem parameters) is not necessarily monotone. Also, counter to intuition, it is possible that the optimal action is PRODUCE, after revealing a conforming unit. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

火箭助飞鱼雷对随机机动目标的射击效率仿真

为解决火箭助飞鱼雷的作战使用问题,需要确定它对随机机动目标的射击效率,通过对该雷空中及水下弹道的各阶段深入细致的分析研究,建立了火箭助飞鱼雷射击效率仿真模型.着重探讨了采用目标现在点射击方法,对随机机动目标的发现概率仿真计算模型,进行了实际仿真计算,并就一些主要参数对射击效率的影响做了较为深入的分析.仿真结果表明,所建立的射击效率模型符合火箭助飞鱼雷的实际,对进一步深入研究其作战使用诸多问题具有一定的参考价值.     

消防行政自由裁量权控制研究

作为公安消防机构的一种相对自由的判断权和选择权,消防行政自由裁量权必须受到有效控制,并在法律规定的范围内合法、合理行使,以确保公安消防机构能够更好的承担起维护社会稳定、保卫人民生命财产安全的神圣职责。根据消防行政自由裁量权的类型及特征,分析了滥用消防行政自由裁量权的表现形式及危害,并结合当前消防工作的形势与要求,阐述了完善我国消防行政自由裁量权的控制策略。     

污水处理过程软测量系统辅助变量的选择方法

辅助变量的选择包括变量类型、数量及检测点的选择,是软测量建模的第一步,直接关系到软测量质量的好坏.针对活性污泥法,从微生物生长繁殖的角度出发,探讨了各要素对于微生物生长活动能力的影响及其相互关系,通过影响力大小及相互间耦合性的复杂程度选取辅助变量的原则,完成了污水处理辅助变量类型的初选,并对辅助变量的精选进行了讨论.     

Probabilistic resource pooling games

We study a setting with a single type of resource and with several players, each associated with a single resource (of this type). Unavailability of these resources comes unexpectedly and with player‐specific costs. Players can cooperate by reallocating the available resources to the ones that need the resources most and let those who suffer the least absorb all the costs. We address the cost savings allocation problem with concepts of cooperative game theory. In particular, we formulate a probabilistic resource pooling game and study them on various properties. We show that these games are not necessarily convex, do have non‐empty cores, and are totally balanced. The latter two are shown via an interesting relationship with Böhm‐Bawerk horse market games. Next, we present an intuitive class of allocation rules for which the resulting allocations are core members and study an allocation rule within this class of allocation rules with an appealing fairness property. Finally, we show that our results can be applied to a spare parts pooling situation.     

ESD EMP能量耦合线性化建模

针对利用非线性建模方法研究静电放电电磁脉冲(Electro Static Discharge Electro Magnetic Pulse,ESD EMP)能量耦合存在计算复杂、模型收敛性能较差的问题,基于ESD辐照实验提出了一种非线性系统线性化建模方法。该方法是将系统响应与激励间的非线性关系转化为线性关系后,利用带遗忘因子的递推最小二乘法进行线性回归来建立模型。首先利用3.5 k V ESD实验数据进行建模,然后应用3.5 kV、4.5 kV ESD实验数据进行模型验证,2种情况下的拟合度均达到94.303 3%。结果表明:线性化建模能有效降低建模难度,且模型精度较高,为ESD能量耦合研究提供了一种简便有效的建模方法。     

Layers of Experiments with Adaptive Combined Design

In the field of nanofabrication, engineers often face unique challenges in resource‐limited experimental budgets, the sensitive nature of process behavior with respect to controllable variables, and highly demanding tolerance requirements. To effectively overcome these challenges, this article proposes a methodology for a sequential design of experiments through batches of experimental runs, aptly named Layers of Experiments with Adaptive Combined Design (LoE/ACD). In higher layers, where process behavior is less understood, experimental regions cover more design space and data points are more spread out. In lower layers, experimental regions are more focused to improve understanding of process sensitivities in a local, data‐rich environment. The experimental design is a combination of a space‐filling and an optimal design with a tuning parameter that is dependent on the amount of information accumulated over the various layers. The proposed LoE/ACD method is applied to optimize a carbon dioxide (epet‐CO2) assisted deposition process for fabricating silver nanoparticles with pressure and temperature variables. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 127–142, 2015     

Single batch machine scheduling with deliveries

We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time p_j and a size s_j. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015